The Dubins–Spanier optimization problem in fair division theory
نویسندگان
چکیده
منابع مشابه
Counterexamples in the Theory of Fair Division
The formal mathematical theory of fair division has a rich history dating back at least to Steinhaus in the 1940’s [Ste1, Ste2, Ste3, Ste4]. In recent work in this area, several general classes of errors have appeared along with confusion about the necessity and sufficiency of certain hypotheses. It is the purpose of this article to correct the scientific record and to point out with concrete e...
متن کاملDynamic Fair Division Problem with General Valuations
In this paper, we focus on how to dynamically allocate a divisible resource fairly among n players who arrive and depart over time. The players may have general heterogeneous valuations over the resource. It is known that the exact envy-free and proportional allocations may not exist in the dynamic setting [21]. Thus, we will study to what extent we can guarantee the fairness in the dynamic set...
متن کاملA fair division solution to the problem of redistricting
Redistricting is the political practice of dividing states into electoral districts of equal population in response to decennial census results to ensure equal representation in the legislative body. Where the boundaries are drawn can dramatically alter the number of districts a given political party can win. As a result, a political party which has control over the legislature, can (and does) ...
متن کاملA New Solution Approach for the Integer Fair Division Problem
In this paper, a solution method for classical fair division problem utilizing cut-and-choose protocol has been examined and a new method has been suggested in order to eliminate the deficiencies of that method. Furthermore, the problem has been generalized and mathematical models have been written according to oddness or evenness of the number of persons and solution techniques have been given...
متن کاملFair Division*
Properties of discrete cake-cutting procedures that use a minimal number of cuts (n – 1 if there are n players) are analyzed. None is always envy-free or efficient, but divideand-conquer (D&C) minimizes the maximum number of players that any single player may envy. It works by asking n ≥ 2 players successively to place marks on a cake that divide it into equal or approximately equal halves, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2001
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(99)00393-3